Searching for Snake-In-The-Box Codes With Evolved Pruning Models
نویسندگان
چکیده
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evolutionary algorithm. These snakes are then analyzed to define a pruning model that constrains the search space. A depth-first search of the constrained solution space has established new lower bounds for the length of the longest snakes in the 9 and 10 dimensional hypercube graphs.
منابع مشابه
Discovering snake-in-the-box codes through pruning based on the exemplary solutions of an Evolutionary Algorithm
We present a method for searching for simple achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains exemplary snakes using an evolutionary algorithm previously responsible for defining the best-known lower bounds in n-cubes for n = 9, 10, 11, and 12. These snakes are used to define a pruning model that constrains the search space. A depth-first sea...
متن کاملSnake-in-the-Box Codes for Rank Modulation
Motivated by the rank-modulation scheme with applications to flash memory, we consider Gray codes capable of detecting a single error, also known as snake-in-the-box codes. We study two error metrics: Kendall’s τ-metric, which applies to charge-constrained errors, and the `∞-metric, which is useful in the case of limited-magnitude errors. In both cases we construct snake-in-the-box codes with r...
متن کاملSnake-in-the-Box Codes for Rank Modulation under Kendall's $τ$-Metric
For a Gray code in the scheme of rank modulation for flash memories, the codewords are permutations and two consecutive codewords are obtained using a push-to-the-top operation. We consider snake-in-the-box codes under Kendall’s τ -metric, which is a Gray code capable of detecting one Kendall’s τ -error. We answer two open problems posed by Horovitz and Etzion. Firstly, we prove the validity of...
متن کاملA new lower bound for snake-in-the-box codes
In this paper we give a new lower bound on the length of Snake-in-the-Box Codes, i.e., induced cycles in the d-dimensional cube. The bound is a linear function of the number of vertices of the cube and improves the bound c · 2/d, where c is a constant, proved by Danzer and Klee. AMS subject classification 1980: 05 C 35, 94 B 25
متن کاملConstructions of Snake-in-the-Box Codes under $\ell_{\infty}$-metric for Rank Modulation
In the rank modulation scheme, Gray codes are very useful in the realization of flash memories. For a Gray code in this scheme, two adjacent codewords are obtained by using one “push-to-the-top” operation. Moreover, snake-in-the-box codes under the l∞-metric are Gray codes, which can be capable of detecting one l∞-error. In this paper, we give two constructions of l∞snakes. On the one hand, ins...
متن کامل